Optimal N-term approximation by linear splines over anisotropic Delaunay triangulations
نویسندگان
چکیده
Anisotropic triangulations provide efficient geometrical methods for sparse representations of bivariate functions from discrete data, in particular from image data. In previous work, we have proposed a locally adaptive method for efficient image approximation, called adaptive thinning, which relies on linear splines over anisotropic Delaunay triangulations. In this paper, we prove asymptotically optimal N -term approximation rates for linear splines over anisotropic Delaunay triangulations, where our analysis applies to relevant classes of target functions: (a) piecewise linear horizon functions across α Hölder smooth boundaries, (b) functions of Wα,p regularity, where α > 2/p−1, (c) piecewise regular horizon functions of Wα,2 regularity, where α > 1.
منابع مشابه
Anisotropic Triangulation Methods in Adaptive Image Approximation
Anisotropic triangulations are utilized in recent methods for sparse representation and adaptive approximation of image data. This article first addresses selected computational aspects concerning image approximation on triangular meshes, before four recent image approximation algorithms, each relying on anisotropic triangulations, are discussed. The discussion includes generic triangulations o...
متن کاملImage Compression with Anisotropic Geodesic Triangulations
We propose a new image compression method based on geodesic Delaunay triangulations. Triangulations are generated by a progressive geodesic meshing algorithm which exploits the anisotropy of images through a farthest point sampling strategy. This seeding is performed according to anisotropic geodesic distances which force the anisotropic Delaunay triangles to follow the geometry of the image. G...
متن کاملNonlinear n-term Approximation from Hierarchical Spline Bases
This article is a survey of some recent developments which concern two multilevel approximation schemes: (a) Nonlinear n-term approximation from piecewise polynomials generated by anisotropic dyadic partitions in R, and (b) Nonlinear n-term approximation from sequences of hierarchical spline bases generated by multilevel triangulations in R. A construction is given of sequences of bases consist...
متن کاملNew analysis of the sphere covering problems and optimal polytope approximation of convex bodies
In this paper, we show that both sphere covering problems and optimal polytope approximation of convex bodies are related to optimal Delaunay triangulations, which are the triangulations minimizing the interpolation error between function ‖x‖2 and its linear interpolant based on the underline triangulations. We then develop a new analysis based on the estimate of the interpolation error to get ...
متن کاملAdaptive multiresolution analysis based on anisotropic triangulations
A simple greedy refinement procedure for the generation of data-adapted triangulations is proposed and studied. Given a function f of two variables, the algorithm produces a hierarchy of triangulations (Dj)j≥0 and piecewise polynomial approximations of f on these triangulations. The refinement procedure consists in bisecting a triangle T in a direction which is chosen so as to minimize the loca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 84 شماره
صفحات -
تاریخ انتشار 2015